- equivalence function
- мат.функция эквивалентности
English-Russian scientific dictionary. 2008.
English-Russian scientific dictionary. 2008.
Equivalence partitioning — is a software testing related technique with the goal: #To reduce the number of test cases to a necessary minimum. #To select the right test cases to cover all possible scenarios. Although in rare cases equivalence partitioning is also applied to … Wikipedia
Equivalence relation — In mathematics, an equivalence relation is a binary relation between two elements of a set which groups them together as being equivalent in some way. Let a , b , and c be arbitrary elements of some set X . Then a b or a ≡ b denotes that a is… … Wikipedia
Equivalence class — This article is about equivalency in mathematics; for equivalency in music see equivalence class (music). In mathematics, given a set X and an equivalence relation on X, the equivalence class of an element a in X is the subset of all elements in… … Wikipedia
Equivalence of metrics — In the study of metric spaces in mathematics, there are various notions of two metrics on the same underlying space being the same , or equivalent.In the following, M will denote a non empty set and d {1} and d {2} will denote two metrics on… … Wikipedia
equivalence — [[t]ɪkwɪ̱vələns[/t]] N UNCOUNT If there is equivalence between two things, they have the same use, function, size, or value. ...the equivalence of science and rationality … English dictionary
equivalence — equivalent ► ADJECTIVE (often equivalent to) 1) equal in value, amount, function, meaning, etc. 2) having the same or a similar effect. ► NOUN ▪ a person or thing that is equivalent to another. DERIVATIVES equivalence noun equivalency noun … English terms dictionary
equivalence — [ɪ kwɪv(ə)l(ə)ns] noun the condition of being equal or equivalent in value, function, etc. Derivatives equivalency noun … English new terms dictionary
Characterizations of the exponential function — In mathematics, the exponential function can be characterized in many ways. The following characterizations (definitions) are most common. This article discusses why each characterization makes sense, and why the characterizations are independent … Wikipedia
Μ-recursive function — In mathematical logic and computer science, the μ recursive functions are a class of partial functions from natural numbers to natural numbers which are computable in an intuitive sense. In fact, in computability theory it is shown that the μ… … Wikipedia
Dehn function — In the mathematical subject of geometric group theory, a Dehn function, named after Max Dehn, is an optimal function associated to a finite group presentation which bounds the area of a relation in that group (that is a freely reduced word in the … Wikipedia
μ-recursive function — In mathematical logic and computer science, the μ recursive functions are a class of partial functions from natural numbers to natural numbers which are computable in an intuitive sense. In fact, in computability theory it is shown that the μ… … Wikipedia